Priority queues with Gaussian input: a path-space approach to loss and delay asymptotics

نویسندگان

  • Michel Mandjes
  • Petteri Mannersalo
چکیده

Priority queueing is the basic technique for providing real-time Quality of Service to packet-based networking. The mathematical analysis of priority queues with general traffic models is, however, prohibitively difficult, in particular when the traffic is long-range dependent. This paper provides some important steps forward in this direction. Our analysis is the first mathematically rigorous treatment of path-space large deviations of priority queues with class-wise heterogeneous Gaussian input having an arbitrary correlation structure. This includes the computation of the most probable paths that lead to overflow in one of the queues. Compared with earlier work on the same topic, the paper provides three novel contributions: a new representation of the workload in the low-priority queues, an exact characterization of the most probable paths, and an extension of the analysis to virtual waiting times, in addition to queue lengths.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sample-path Large Deviations for Tandem and Priority Queues with Gaussian Inputs

This paper considers Gaussian flows multiplexed in a queueing network. A single node being a useful but often incomplete setting, we examine more advanced models. We focus on a (two-node) tandem queue, fed by a large number of Gaussian inputs. With service rates and buffer sizes at both nodes scaled appropriately, Schilder’s sample-path large-deviations theorem can be applied to calculate the a...

متن کامل

Experimental Study of High Performance Priority Queues

The priority queue is a very important and widely used data structure in computer science, with a variety of applications including Dijkstra’s Single Source Shortest Path algorithm on sparse graph types. This study presents the experimental results of a variety of priority queues. The focus of the experiments is to measure the speed and performance of highly specialized priority queues in out-o...

متن کامل

Gaussian tandem queues with an application to dimensioning of switch fabric interfaces

Tandem systems are seen in many places and at various hierarchical levels in highspeed communication networks, from router architectures to protocol stacks. If the traffic fed into the system is generated by independent or weakly dependent sources and the smallest relevant time scale is not too fine, the central limit theorem suggests that the input traffic is (close to) Gaussian. This paper co...

متن کامل

MODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS

Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005